Algorithms for discovering Regular Plans in Wireless Mobile Environment

The emerging wireless communication technology gives mobile financial services, location-based services by providing users with the capability of accessing data at any time and place. The broadcast problem including the plan design is considered. The data are inserted and numbered at a predefined order into customized size relations. The server fetches the requests and broadcasts the data to the air. A set of algorithms can guarantee, the creation of a full Regular Broadcast Plan (RBP), for the server with equal spacing repeated instances of items using single or multiple channels. First, the Basic regular (BRA) and the Partition Value algorithm (PVA), can provide a static and dynamic RBP construction with multiple constraints solutions respectively. PVA can also build the grouping of strong relations with minimum number of channels. Second, the Grouping Dimensioning Algorithm (GD provides dynamic solutions and, creates groups with predefined average access time, considering economy of channels. The Cuchoo Search Algorithm (CS) is selected for optimization. CS can discover the RBPs with minimum number of channels. Theorems for discovery RBPs with their criteria are used for preparing the conditions for developing the CS algorithms. Servers with these advantages, in addition to their self-monitoring and self-organizing, will have the ability for channel availability and lower energy consumption by using smaller number of channels. Simulation results are provided. Key-Words: -Broadcasting, Mobile Computing, Cuchoo Algorithm, Broadcast Plan, Relations, Grouping, Wireless Network.